一种通过梯形PPMgLN波导倍频实现带宽可调谐光源的理论研究

本文设计了一种梯形的周期极化掺镁铌酸锂(PPMgLN)波导,并通过在传播方向上引入温度梯度来拓宽其倍频(SHG)过程的泵浦光源可接收带宽。通过有限差分的光束传输法,计算波导的有效折射率,并进行波导尺寸的设计。结果表明,通过改变梯形波导不同位置的温度,使其形成一个温度梯度,可拓宽泵浦光源的波长可接收带宽。本文所设计的PPMgLN波导最大泵浦光源可接收带宽为C波段,即1 530~1 565 nm,该波导可倍频C波段,得到输出波段带宽为765~782.5 nm,温度调谐范围为30~150 ℃。     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

On the Brauer p-dimension of Henselian discrete valued fields of residual characteristic p > 0

Let $(K,v)$ be a Henselian discrete valued field with residue field $\stackrel{?}{K}$ of characteristic $p>0$, and ${\text{Brd}}_p(K)$ be the Brauer p-dimension of K. This paper shows that ${\text{Brd}}_p(K)\ge n$ if $[\stackrel{?}{K}:{\stackrel{?}{K}}^p]=p^n$, for some $n\in \mathbb{N}$. It proves that ${\text{Brd}}_p(K)=\infty$ if and only if $[\stackrel{?}{K}:{\stackrel{?}{K}}^p]=\infty$.     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.     

Hjelmslev quadrilateral central configurations

A Hjelmslev quadrilateral is a quadrilateral with two right angles at opposite vertices. Using mutual distances as coordinates, we show that any four-body central configuration forming a Hjelmslev quadrilateral must be a right kite configuration.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.